Treatment-effect identification without parallel paths
نویسندگان
چکیده
منابع مشابه
Parallel Single-Source Shortest Paths
We designed and implemented a parallel algorithm for solving the single-source shortest paths (SSSP) problem for graphs with nonnegative edge weights, based on Gabow’s scaling algorithm for SSSP. This parallel Gabow algorithm attains a theoretical parallelism of Ω(E/(V lg∆ lgE/D)) in the worst case and Ω(E/(D lgV/D lgE/D lgDelta)with high probability on a random graph. In practice this algorith...
متن کاملReasoning about connectivity without paths
In graph theory connectivity is stated, prevailingly, in terms of paths. While exploiting a proof assistant to check formal reasoning about graphs, we chose to work with an alternative characterization of connectivity: for, within the framework of the underlying set theory, it requires virtually no preparatory notions. We say that a graphs devoid of isolated vertices is connected if no subset o...
متن کاملShortest Paths Without a Map
Papadimitriou, C.H. and M. Yannakakis, Shortest paths without a map, Theoretical Computer Science 84 (1991) 127-150. We study several versions of the shortest-path problem when the map is not known in advance, but is specified dynamically. We are seeking dynamic decision rules that optimize the worst-case ratio of the distance covered to the length of the (statically) optimal path. We describe ...
متن کاملImplementing parallel shortest-paths algorithms
We have implemented a parallel version of the Bellman-Ford algorithm for the single-source shortest paths problem. Our software has been developed on the CM-5 using C with CMMD communication primitives. We have empirically compared the eeciency of our implementation with a sequential implementation of the Bellman-Ford-Moore algorithm developed by Cherkassky, Goldberg and Radzik. We have perform...
متن کاملConnected graphs without long paths
A problem, first considered by Erdős and Gallai [2], was to determine the maximum number of edges in any graph on n vertices if it contains no path with k + 1 vertices. This maximum number, ext(n, Pk+1), is called the extremal number for the path Pk+1. Erdős and Gallai proved the following theorem, which was one of the earliest extremal results in graph theory. Theorem 1.1 ([2]). For every k ≥ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Economics
سال: 2018
ISSN: 1864-6042
DOI: 10.5018/economics-ejournal.ja.2018-9